What must and what need not be contained in a graph of uncountable chromatic number?
نویسندگان
چکیده
In this paper graphs with uncountable chromatic numbers will be studied. As usual, a graph is an ordered pair G = ( V , E), where V is an arbitrary set (the set of vertices), E is a set of unordered pairs from V (the set of edges). A function : V + x (n a cardinal), is a good coloring of G if and only if f ( x ) ¢ f ( y ) whenever x and y are jo ined i.e. joined vertices get different colors. The chromatic number of G, Chr (G) is the minimal cardinal n onto which a good coloring of G exists. The following statement was proved by Tutte, Zykov, Ung~r, Mycielski and possibly by many other people (see e.g. [9], [11]): for every finite n there exists an n-chromatic triangle-free graph. P. Erd6s and R. Rado proved in [5] that for every cardinality g there exists a triangle-free n-chromatic glaph of cardinality n. P. Erd6s proved (see [1]) that for any given finite n and s there exist n-chromatic graphs without circuits of length ~s . His proof was non-constructive. A constructive p~oof was later found by L. Lov~isz [8]. However quite surprisingly, the natural common generalization of these theorems turned out to be false: if a graph has chromatic number ~ R1 then it necessarily contains a four-cycle, moreover every finite bipartite graph must be contained in such a graph. As examples show, for every s<~o and arbitrary cardinality n there exist graphs with chromatic number n (and of cardinality n) without any odd circuit of length ~ s (see [3]). Thus, all finite obligatory graphs are described. The next problems are the following: find the obligatory classes of finite graphs and the obligatory countable graphs. Both problems seem to be very difficult (see [4]). In this paper we try to attack the second problem by displaying two graphs F and A which are very close together and though F is obligatory A is not (at least consistently).
منابع مشابه
Computing Multiplicative Zagreb Indices with Respect to Chromatic and Clique Numbers
The chromatic number of a graph G, denoted by χ(G), is the minimum number of colors such that G can be colored with these colors in such a way that no two adjacent vertices have the same color. A clique in a graph is a set of mutually adjacent vertices. The maximum size of a clique in a graph G is called the clique number of G. The Turán graph Tn(k) is a complete k-partite graph whose partition...
متن کاملThe distinguishing chromatic number of bipartite graphs of girth at least six
The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...
متن کاملThe Colouring Number
It was proved by Tutte in [23] that for every finite n an n -chromatic triangle-free graph exists. Later Erdos and Rado [10] extended this result to infinite n. Another extension of a different kind was found by Erdos in [5]: if n, s are finite numbers, there exists an n-chromatic graph without circuits of length at most s. The proof was non-constructive, a construction was later found by Lov£s...
متن کاملChromatic polynomials of some nanostars
Let G be a simple graph and (G,) denotes the number of proper vertex colourings of G with at most colours, which is for a fixed graph G , a polynomial in , which is called the chromatic polynomial of G . Using the chromatic polynomial of some specific graphs, we obtain the chromatic polynomials of some nanostars.
متن کاملThe locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorica
دوره 4 شماره
صفحات -
تاریخ انتشار 1984